5-sparse Steiner Triple Systems of Order n Exist for Almost All Admissible n
نویسنده
چکیده
Steiner triple systems are known to exist for orders n ≡ 1, 3 mod 6, the admissible orders. There are many known constructions for infinite classes of Steiner triple systems. However, Steiner triple systems that lack prescribed configurations are harder to find. This paper gives a proof that the spectrum of orders of 5-sparse Steiner triple systems has arithmetic density 1 as compared to the admissible orders. 1 Background Let v ∈ N and let V be a v-set. A Steiner triple system of order v, abbreviated STS(v), is a collection B of 3-sets of V , called blocks or triples, such that every distinct pair of elements of V lies in exactly one triple of B. An STS(v) exists exactly when v ≡ 1 or 3 mod 6, the admissible orders. Wilson [13] showed that the number of non-isomorphic Steiner triple systems of order n is asymptotically at least (e−5n)n 2/6. Much less is known about the existence of Steiner triple systems that avoid certain configurations. An rconfiguration of a system is a set of r distinct triples whose union consists of no more than r + 2 points. A Steiner triple system that lacks r-configurations is said to be r-sparse. In other words, a Steiner triple system where the union of every r distinct triples has at least r + 3 points is r-sparse. In 1976, Paul Erdős conjectured that for any r > 1, there exists a constant Nr such that whenever v > Nr and v is an admissible order, an r-sparse STS(v) exists[4]. The statement is trivial for r = 2, 3. For r = 4, there is only one type of 4-configuration, a Pasch. Paschs have the form: {a, b, c}, {a, d, e}, {f, b, d}, {f, c, e} (1) ∗Thanks to the editors of this journal for considering this for publication. the electronic journal of combinatorics 12 (2005), #R68 1 In this paper, Paschs are written in the order presented above. Viewing a Steiner triple system as a 3-regular hypergraph with the point-set of the graph being the points of the Steiner triple system and the edge-set being the triples, we can graphically represent the system by plotting the point set as vertices and connecting the three vertices of an edge (triple) by a smooth line. With this in mind, a Pasch as in (1) can be graphically represented as:
منابع مشابه
Steiner almost self-complementary graphs and halving near-Steiner triple systems
We show that for every admissible order v ≡ 0 or 2 (mod 6) there exists a near-Steiner triple system of order v that can be halved. As a corollary we obtain that a Steiner almost self-complementary graph with n vertices exists if and only if n ≡ 0 or 2 (mod 6). © 2008 Elsevier B.V. All rights reserved.
متن کاملDistance and fractional isomorphism in Steiner triple systems
A.D. Forbes, M.J. Grannell and T.S. Griggs Department of Mathematics The Open University Walton Hall, Milton Keynes MK7 6AA UNITED KINGDOM [email protected] [email protected] [email protected] Abstract In [8], Quattrochi and Rinaldi introduced the idea of n−1 isomorphism between Steiner systems. In this paper we study this concept in the context of Steiner triple systems. Th...
متن کاملEmbedding Partial Steiner Triple Systems
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...
متن کاملThe embedding problem for partial Steiner triple systems
The system has the nice property that any pair of distinct elements of V occurs in exactly one of the subsets. This makes it an example of a Steiner triple system. Steiner triple systems first appeared in the mathematical literature in the mid-nineteenth century but the concept must surely have been thought of long before then. An excellent historical introduction appears in [7]. As pointed out...
متن کاملA second infinite family of Steiner triple systems without almost parallel classes
For each positive integer n, we construct a Steiner triple system of order v = 2(3n) + 1 with no almost parallel class; that is, with no set of v−1 3 disjoint triples. In fact, we construct families of (v, k, λ)-designs with an analogous property. The only previously known examples of Steiner triple systems of order congruent to 1 (mod 6) without almost parallel classes were the projective trip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005